/*!
Copyright (C) 2014, 申瑞珉 (Ruimin Shen)

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#pragma once

#include <cassert>
#include <cmath>
#include <numeric>

namespace otl
{
namespace problem
{
namespace wfg
{
namespace transform
{
template <typename _TReal>
void Degenerate(std::vector<_TReal> &decision, const std::vector<_TReal> &degenerate, const _TReal distance)
{
	assert(degenerate.size() > 0);
	assert(degenerate.size() <= decision.size());
	for(size_t i = 0; i < degenerate.size(); ++i)
	{
		const _TReal tmp = std::max<_TReal>(distance, degenerate[i]);
		decision[i] = tmp * (decision[i] - 0.5) + 0.5;
	}
}
}
}
}
}
